TSTP Solution File: SET027^5 by cocATP---0.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SET027^5 : TPTP v6.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n099.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32286.75MB
% OS       : Linux 2.6.32-431.20.3.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 17 13:29:59 EDT 2014

% Result   : Theorem 0.43s
% Output   : Proof 0.43s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SET027^5 : TPTP v6.1.0. Released v4.0.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n099.star.cs.uiowa.edu
% % Model    : x86_64 x86_64
% % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory   : 32286.75MB
% % OS       : Linux 2.6.32-431.20.3.el6.x86_64
% % CPULimit : 300
% % DateTime : Thu Jul 17 08:05:21 CDT 2014
% % CPUTime  : 0.43 
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula (<kernel.Constant object at 0x2387248>, <kernel.Type object at 0x2387758>) of role type named a_type
% Using role type
% Declaring a:Type
% FOF formula (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))->(forall (Xx:a), ((X Xx)->(Z Xx))))) of role conjecture named cBOOL_PROP_29_pme
% Conjecture to prove = (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))->(forall (Xx:a), ((X Xx)->(Z Xx))))):Prop
% Parameter a_DUMMY:a.
% We need to prove ['(forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))->(forall (Xx:a), ((X Xx)->(Z Xx)))))']
% Parameter a:Type.
% Trying to prove (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))->(forall (Xx:a), ((X Xx)->(Z Xx)))))
% Found x100:=(x10 x0):(Y Xx)
% Found (x10 x0) as proof of (Y Xx)
% Found ((x1 Xx) x0) as proof of (Y Xx)
% Found ((x1 Xx) x0) as proof of (Y Xx)
% Found (x20 ((x1 Xx) x0)) as proof of (Z Xx)
% Found ((x2 Xx) ((x1 Xx) x0)) as proof of (Z Xx)
% Found (fun (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0))) as proof of (Z Xx)
% Found (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0))) as proof of ((forall (Xx0:a), ((Y Xx0)->(Z Xx0)))->(Z Xx))
% Found (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0))) as proof of ((forall (Xx0:a), ((X Xx0)->(Y Xx0)))->((forall (Xx0:a), ((Y Xx0)->(Z Xx0)))->(Z Xx)))
% Found (and_rect00 (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0)))) as proof of (Z Xx)
% Found ((and_rect0 (Z Xx)) (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0)))) as proof of (Z Xx)
% Found (((fun (P:Type) (x1:((forall (Xx:a), ((X Xx)->(Y Xx)))->((forall (Xx:a), ((Y Xx)->(Z Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx)))) P) x1) x)) (Z Xx)) (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0)))) as proof of (Z Xx)
% Found (fun (x0:(X Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((X Xx)->(Y Xx)))->((forall (Xx:a), ((Y Xx)->(Z Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx)))) P) x1) x)) (Z Xx)) (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0))))) as proof of (Z Xx)
% Found (fun (Xx:a) (x0:(X Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((X Xx)->(Y Xx)))->((forall (Xx:a), ((Y Xx)->(Z Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx)))) P) x1) x)) (Z Xx)) (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0))))) as proof of ((X Xx)->(Z Xx))
% Found (fun (x:((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))) (Xx:a) (x0:(X Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((X Xx)->(Y Xx)))->((forall (Xx:a), ((Y Xx)->(Z Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx)))) P) x1) x)) (Z Xx)) (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0))))) as proof of (forall (Xx:a), ((X Xx)->(Z Xx)))
% Found (fun (Z:(a->Prop)) (x:((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))) (Xx:a) (x0:(X Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((X Xx)->(Y Xx)))->((forall (Xx:a), ((Y Xx)->(Z Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx)))) P) x1) x)) (Z Xx)) (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0))))) as proof of (((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))->(forall (Xx:a), ((X Xx)->(Z Xx))))
% Found (fun (Y:(a->Prop)) (Z:(a->Prop)) (x:((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))) (Xx:a) (x0:(X Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((X Xx)->(Y Xx)))->((forall (Xx:a), ((Y Xx)->(Z Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx)))) P) x1) x)) (Z Xx)) (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0))))) as proof of (forall (Z:(a->Prop)), (((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))->(forall (Xx:a), ((X Xx)->(Z Xx)))))
% Found (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)) (x:((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))) (Xx:a) (x0:(X Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((X Xx)->(Y Xx)))->((forall (Xx:a), ((Y Xx)->(Z Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx)))) P) x1) x)) (Z Xx)) (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0))))) as proof of (forall (Y:(a->Prop)) (Z:(a->Prop)), (((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))->(forall (Xx:a), ((X Xx)->(Z Xx)))))
% Found (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)) (x:((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))) (Xx:a) (x0:(X Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((X Xx)->(Y Xx)))->((forall (Xx:a), ((Y Xx)->(Z Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx)))) P) x1) x)) (Z Xx)) (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0))))) as proof of (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))->(forall (Xx:a), ((X Xx)->(Z Xx)))))
% Got proof (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)) (x:((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))) (Xx:a) (x0:(X Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((X Xx)->(Y Xx)))->((forall (Xx:a), ((Y Xx)->(Z Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx)))) P) x1) x)) (Z Xx)) (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0)))))
% Time elapsed = 0.116730s
% node=17 cost=255.000000 depth=17
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)) (x:((and (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx))))) (Xx:a) (x0:(X Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((X Xx)->(Y Xx)))->((forall (Xx:a), ((Y Xx)->(Z Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((X Xx)->(Y Xx)))) (forall (Xx:a), ((Y Xx)->(Z Xx)))) P) x1) x)) (Z Xx)) (fun (x1:(forall (Xx0:a), ((X Xx0)->(Y Xx0)))) (x2:(forall (Xx0:a), ((Y Xx0)->(Z Xx0))))=> ((x2 Xx) ((x1 Xx) x0)))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------